Solving a continuous multifacility location problem by DC algorithms

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel algorithms for continuous multifacility competitive location problems

We consider a continuous location problem in which a firm wants to set up two or more new facilities in a competitive environment. Both the locations and the qualities of the new facilities are to be found so as to maximize the profit obtained by the firm. This hard-to-solve global optimization problem has been addressed in [38] using several heuristic approaches. Through a comprehensive comput...

متن کامل

A Multifacility Location Problem on Median Spaces

This paper is concerned with the problem of locating II new facilities in the median space when there are k facilities already located. The objective is to minimize the weighted sum of distances. Necessary and sufficient conditions are established. Based on these results a polynomial algorithm is presented. The algorithm requires the solution of a sequence of minimum-cut problems. The complexit...

متن کامل

Solving a generalized aggregate production planning problem by genetic algorithms

This paper presents a genetic algorithm (GA) for solving a generalized model of single-item resource-constrained aggregate production planning (APP) with linear cost functions. APP belongs to a class of pro-duction planning problems in which there is a single production variable representing the total production of all products. We linearize a linear mixed-integer model of APP subject to hiring...

متن کامل

Hard cases of the multifacility location problem

Let μ be a rational-valued metric on a finite set T . We consider (a version of) the multifacility location problem: given a finite set V ⊇ T and a function c : V2 ) → Z+, attach each element x ∈ V − T to an element γ(x) ∈ T minimizing ∑(c(xy)μ(γ(x)γ(y)) : xy ∈ V2 ) ), letting γ(t) := t for each t ∈ T . Large classes of metrics μ have been known for which the problem is solvable in polynomial t...

متن کامل

Exact algorithms for solving a bi-level location–allocation problem considering customer preferences

The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Methods and Software

سال: 2020

ISSN: 1055-6788,1029-4937

DOI: 10.1080/10556788.2020.1771335